265 research outputs found

    On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism

    Get PDF
    In this paper we address the problem of the uniform random generation of non deterministic automata (NFA) up to isomorphism. First, we show how to use a Monte-Carlo approach to uniformly sample a NFA. Secondly, we show how to use the Metropolis-Hastings Algorithm to uniformly generate NFAs up to isomorphism. Using labeling techniques, we show that in practice it is possible to move into the modified Markov Chain efficiently, allowing the random generation of NFAs up to isomorphism with dozens of states. This general approach is also applied to several interesting subclasses of NFAs (up to isomorphism), such as NFAs having a unique initial states and a bounded output degree. Finally, we prove that for these interesting subclasses of NFAs, moving into the Metropolis Markov chain can be done in polynomial time. Promising experimental results constitute a practical contribution.Comment: Frank Drewes. CIAA 2015, Aug 2015, Umea, Sweden. Springer, 9223, pp.12, 2015, Implementation and Application of Automata - 20th International Conferenc

    The T allele of the hepatic lipase promoter variant C-480T is associated with increased fasting lipids and HDL and increased preprandial and postprandial LpCIII:B : European Atherosclerosis Research Study (EARS) II

    Get PDF
    The common C-480T transition in the hepatic lipase (HL) promoter has been shown to be associated with lower HL activity and increased high density lipoprotein (HDL) cholesterol. We examined the frequency and lipid associations of this HL polymorphism in 385 healthy, young (18- to 28-year-old) men whose fathers had had a premature myocardial infarction (designated cases) and 405 age-matched controls. These individuals were participants in the European Atherosclerosis Research Study II postprandial trial, who had been recruited from 11 European countries in 4 regions (the Baltic; United Kingdom; and central and southern Europe). Overall, the frequency of the T allele was 0.207 in controls and 0.244 in cases (P=0.08). The T allele was associated with higher fasting plasma total cholesterol (P<0.01), triglycerides (P<0.01), and HDL cholesterol (P<0.01). The strongest association was found with apolipoprotein (apo) A-I concentration, which was 10% higher in individuals homozygous for the T allele compared with those homozygous for the C allele (P<0.001). This polymorphism had no effect on the rise in plasma triglyceride levels after a fatty meal. However, before and after the fat load was ingested, levels of particles containing both apoC-III and apoB (LpC-III:B) were higher in carriers of the T allele, with homozygotes having 23% and 27% higher levels preprandially and postprandially, respectively, than those homozygous for the C allele (P<0.05). Thus, our results demonstrate that the C-480T polymorphism in the HL promoter is associated with alterations in plasma lipids and lipoproteins and the accumulation of atherogenic LpC-III:B particles

    A New Technique for Reachability of States in Concatenation Automata

    Full text link
    We present a new technique for demonstrating the reachability of states in deterministic finite automata representing the concatenation of two languages. Such demonstrations are a necessary step in establishing the state complexity of the concatenation of two languages, and thus in establishing the state complexity of concatenation as an operation. Typically, ad-hoc induction arguments are used to show particular states are reachable in concatenation automata. We prove some results that seem to capture the essence of many of these induction arguments. Using these results, reachability proofs in concatenation automata can often be done more simply and without using induction directly.Comment: 23 pages, 1 table. Added missing affiliation/funding informatio

    Synchronizing Random Almost-Group Automata

    Full text link
    In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing (unless they have one state). In almost-group automata, one of the letters acts as a permutation on n1n-1 states, and the others as permutations. We prove that this small change is enough for automata to become synchronizing with high probability. More precisely, we establish that the probability that a strongly connected almost-group automaton is not synchronizing is 2k11n2(k1)(1+o(1))\frac{2^{k-1}-1}{n^{2(k-1)}}(1+o(1)), for a kk-letter alphabet.Comment: full version prepared for CIAA 201

    Brzozowski Algorithm Is Generically Super-Polynomial Deterministic Automata

    Get PDF
    International audienceWe study the number of states of the minimal automaton of the mirror of a rational language recognized by a random deterministic automaton with n states. We prove that, for any d > 0, the probability that this number of states is greater than nd tends to 1 as n tends to infinity. As a consequence, the generic and average complexities of Brzozowski minimization algorithm are super-polynomial for the uniform distribution on deterministic automata

    Alternative Splicing Regulates Targeting of Malate Dehydrogenase in Yarrowia lipolytica

    Get PDF
    Alternative pre-mRNA splicing is a major mechanism contributing to the proteome complexity of most eukaryotes, especially mammals. In less complex organisms, such as yeasts, the numbers of genes that contain introns are low and cases of alternative splicing (AS) with functional implications are rare. We report the first case of AS with functional consequences in the yeast Yarrowia lipolytica. The splicing pattern was found to govern the cellular localization of malate dehydrogenase, an enzyme of the central carbon metabolism. This ubiquitous enzyme is involved in the tricarboxylic acid cycle in mitochondria and in the glyoxylate cycle, which takes place in peroxisomes and the cytosol. In Saccharomyces cerevisiae, three genes encode three compartment-specific enzymes. In contrast, only two genes exist in Y. lipolytica. One gene (YlMDH1, YALI0D16753g) encodes a predicted mitochondrial protein, whereas the second gene (YlMDH2, YALI0E14190g) generates the cytosolic and peroxisomal forms through the alternative use of two 3′-splice sites in the second intron. Both splicing variants were detected in cDNA libraries obtained from cells grown under different conditions. Mutants expressing the individual YlMdh2p isoforms tagged with fluorescent proteins confirmed that they localized to either the cytosolic or the peroxisomal compartment
    corecore